A Computational Approach to Conley’s Decomposition Theorem

A Computational Approach to Conley’s Decomposition Theorem

The discrete dynamics generated by a continuous map can be represented combinatorially by an appropriate multivalued map on a discretization of the phase space such as a cubical grid or triangulation. In this paper we provide explicit algorithms and computational complexity bounds for computing dynamical structures for the resulting combinatorial multivalued maps. Specifically we focus on the c...

A Martingale Decomposition Theorem

A Cohomology Decomposition Theorem

In [9] Jackowski and McClure gave a homotopy decomposition theorem for the classifying space of a compact Lie group G; their theorem states that for any prime p the space BG can be constructed at p as the homotopy direct limit of a specific diagram involving the classifying spaces of centralizers of elementary abelian p-subgroups of G. In this paper we will prove a parallel algebraic decomposit...

non-corrective approach to pronunciation

the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...

iranian english learners’ perception and personality: a dual approach to investigating influential factors on willingness to communicate

abstract previous studies on willingness to communicate (wtc) have shown the influence of many individual or situational factors on students’ tendency to engage in classroom communication, in which wtc has been viewed either at the trait-level or situational level. however, due to the complexity of the notion of willingness to communicate, the present study suggests that these two strands are ...